A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

نویسندگان

  • Zeger Degraeve
  • Raf Jans
چکیده

The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP), as already proposed by Manne in 1958, has an important structural deficiency. Imposing integrality constraints on the variables in the full blown master will not necessarily give the optimal IP solution as only production plans which satisfy the Wagner-Whitin condition can be selected. It is well known that the optimal solution to a capacitated lot sizing problem will not necessarily have this Wagner-Whitin property. The columns of the traditional decomposition model include both the integer set up and continuous production quantity decisions. Choosing a specific set up schedule implies also taking the associated WagnerWhitin production quantities. We propose the correct Dantzig-Wolfe decomposition reformulation separating the set up and production decisions. This formulation gives the same lower bound as Manne’s reformulation and allows for branch-and-price. We use the Capacitated Lot Sizing Problem with Set Up Times to illustrate our approach. Computational experiments are presented on data sets available from the literature. Column generation is speeded up by a combination of simplex and subgradient optimization for finding the dual prices. The results show that branch-and-price is computationally tractable and competitive with other approaches. Finally, we briefly discuss how this new Dantzig-Wolfe reformulation can be generalized to other mixed integer programming problems, whereas in the literature, branch-and-price algorithms are almost exclusively developed for pure integer programming problems. 5001-6182 Business 5201-5982 Business Science Library of Congress Classification (LCC) QA 1-939 Mathematics M Business Administration and Business Economics M 11 R 4 Production Management Transportation Systems Journal of Economic Literature (JEL) C 61 Programming models 85 A Business General 260 K 240 B Logistics Information Systems Management European Business Schools Library Group (EBSLG) 250 A Mathematics Gemeenschappelijke Onderwerpsontsluiting (GOO) 85.00 Bedrijfskunde, Organisatiekunde: algemeen 85.34 85.20 Logistiek management Bestuurlijke informatie, informatieverzorging Classification GOO 31.80 Toepassingen van de wiskunde Bedrijfskunde / Bedrijfseconomie Bedrijfsprocessen, logistiek, management informatiesystemen

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Item Capacitated Lot-Sizing Problems with Setup Times and Pricing Decisions

We study a multi-item capacitated lot-sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set price...

متن کامل

A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times

We introduce Horizon Decomposition in the context of Dantzig-Wolfe Decomposition, and apply it to the Capacitated Lot-Sizing Problem with Setup Times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

[1] Corresponding author e-mail: [email protected]   [1] Corresponding author e-mail: [email protected]   Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...

متن کامل

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2007